SPV and Mutation based Artificial Bee Colony Algorithm for Travelling Salesman Problem

نویسندگان

  • Ashay Shrivastava
  • Manish Gupta
  • Shashank Swami
  • Shraddha Saxena
  • Kavita Sharma
  • Savita Shiwani
  • Harish Sharma
  • Amit Singh
  • Neetesh Gupta
  • Nishant Pathak
  • Sudhanshu Tiwari
چکیده

Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself. . In this proposed work, enhanced ABC algorithm with SPV for travelling salesman problem is used. In this modified bee colony algorithm, additional phase in the form of mutation is used after the scout bee phase and the SPV rule is used in this work for improving local search. After modification, proposed algorithm is implemented on standard travelling salesman problem for checking the efficiency of proposed work. The experimental results are compared with ABC algorithm and ABC with SPV algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced Artificial Bee Colony Algorithm and It's Application to Travelling Salesman Problem

A rtificial bee Colony algorithm (ABC) is a population based heuristic search technique used for optimization problems. ABC is a very effective optimization technique for continuous optimization problem. Crossover operators have a better exploration property so crossover operators are added to the ABC. This paper presents ABC with different types of real coded crossover operator and its applica...

متن کامل

A Hybrid Mutation-based Artificial Bee Colony for Traveling Salesman Problem

Travelling Salesman Problem (TSP) belongs to the class of NP-Complete problems. It has been proved that evolutionary algorithms are effective and efficient, with respect to the traditional methods for solving NP-Complete problems like TSP, with avoidance trapping in local minima areas. Artificial Bee Colony (ABC) is a new swarm-based optimization algorithm, which inspired by the foraging behavi...

متن کامل

A review on Artificial Bee Colony algorithm

In recent years large number of algorithms based on the swarm intelligence has been proposed by various researchers. The Artificial Bee Colony (ABC) algorithm is one of most popular stochastic, swarm based algorithm proposed by Karaboga in 2005 inspired from the foraging behavior of honey bees. In short span of time, ABC algorithm has gain wide popularity among researchers due to its simplicity...

متن کامل

A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES

A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...

متن کامل

A Discrete Artificial Bee Colony Algorithm for TSP Problem

In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015